A Sequential Search Distribution: Proofreading, Russian Roulette, and the Incomplete q-Eulerian Polynomials
نویسندگان
چکیده
The distribution for the number of searches needed to find k of n lost objects is expressed in terms of a refinement of the q-Eulerian polynomials, for which formulae are developed involving homogeneous symmetric polynomials. In the case when k � n and the find probability remains constant, relatively simple and efficient formulas are obtained. From our main theorem, we further (1) deduce the inverse absorption distribution and (2) determine the expected number of times the survivor pulls the trigger in an n-player game of Russian roulette.
منابع مشابه
Sequential Searches: Proofreading, Russian Roulette, and the Incomplete q-Eulerian Polynomials Revisited
1. INTRODUCTION. So, you've read your fifty page manuscript a half dozen times and you continue to stumble across annoying typos. Is there any end in sight? Just how many more times do you need to read it before you're satisfied? For purposes of discussion, let's say that your manuscript originally contained 10 errors and that, because of fatigue and a certain level of impatience, the probabili...
متن کاملq-EULERIAN POLYNOMIALS: EXCEDANCE NUMBER AND MAJOR INDEX
In this research announcement we present a new q-analog of a classical formula for the exponential generating function of the Eulerian polynomials. The Eulerian polynomials enumerate permutations according to their number of descents or their number of excedances. Our q-Eulerian polynomials are the enumerators for the joint distribution of the excedance statistic and the major index. There is a...
متن کاملEulerian Quasisymmetric Functions and Poset Topology
We introduce a family of quasisymmetric functions called Eulerian quasisymmetric functions, which have the property of specializing to enumerators for the joint distribution of the permutation statistics, major index and excedance number on permutations of fixed cycle type. This family is analogous to a family of quasisymmetric functions that Gessel and Reutenauer used to study the joint distri...
متن کاملOn some Generalized q-Eulerian Polynomials
The (q, r)-Eulerian polynomials are the (maj−exc, fix, exc) enumerative polynomials of permutations. Using Shareshian and Wachs’ exponential generating function of these Eulerian polynomials, Chung and Graham proved two symmetrical q-Eulerian identities and asked for bijective proofs. We provide such proofs using Foata and Han’s three-variable statistic (inv−lec, pix, lec). We also prove a new ...
متن کاملGamma-positivity of Variations of Eulerian Polynomials
An identity of Chung, Graham and Knuth involving binomial coefficients and Eulerian numbers motivates our study of a class of polynomials that we call binomial-Eulerian polynomials. These polynomials share several properties with the Eulerian polynomials. For one thing, they are h-polynomials of simplicial polytopes, which gives a geometric interpretation of the fact that they are palindromic a...
متن کامل